Comprehensive support for developing graphical highly interactive user interface systems

The general problem of application development of interactive GUI applications has been addressed by toolkits, libraries, user interface management systems, and more recently domain-specific application frameworks. However, the most sophisticated solution offered by frameworks still lacks a number of features which are addressed by this research: 1) limited functionality -- the framework does little to help the developer implement the application's functionality. 2) weak model of the application -- the framework does not incorporate a strong model of the overall architecture of the application program. 3) representation of control sequences is difficult to understand, edit, and reuse -- higher-level, direct-manipulation tools are needed. We address these problems with a new framework design called Oregon Speedcode Universe version 3.0 (OSU v3.0) which is shown, by demonstration, to overcome the limitations above: 1) functionality is provided by a rich set of built-in functions organized as a class hierarchy, 2) a strong model is provided by OSU v3.0 in the form of a modified MVC paradigm, and a Petri net based sequencing language which together form the architectural structure of all applications produced by OSU v3.0. 3) representation of control sequences is easily constructed within OSU v3.0 using a Petri net editor, and other direct manipulation tools built on top of the framework. In ddition: 1) applications developed in OSU v3.0 are partially portable because the framework can be moved to another platform, and applications are dependent on the class hierarchy of OSU v3.0 rather than the operating system of a particular platform, 2) the functionality of OSU v3.0 is extendable through addition of classes, subclassing, and overriding of existing methods. The main contribution of this research is in the design of an application framework that uses Petri nets as the computational model of data processing in the synthesized application. OSU v3.0 is the first framework to formalize sequencing, and to show that complex GUI applications can indeed be quickly and reliably produced from such a framework

Design and implementation of pesticide residues detection system

[[abstract]]At present, pesticide residue testing is done by professionals in the laboratory, because test results are not fast enough for market demand. The process of taking data is cumbersome and error-prone; although some operators have developed wireless pesticide residue detectors. But its' Internet of Things (IoT) system can only upload detection results to the database, and does not carry out subsequent analysis or provide warning services. This study will redesign and implement an IoT pesticide residue detection system, which will allow users to view the detection results through the webpage and mobile app after uploading those results. At the same time, when there are some abnormal situations like missing spare parts or getting abnormal detection results, this system will automatically send a warning message to the relevant person's mobile phone, so the users can fix errors as soon as possible. Besides, this study also designed a sharing function; this function allows users to set conditions to list the filtered detection results, and automatically send the QR code and website address of the detection results list to the user mailbox. Finally, the user can send the QR code or website to other relevant personnel for confirmation of detection results.[[notice]]補正完

Finding hamiltonian cycles on incrementally extensible hypercube graphs

[[abstract]]The existence of a Hamiltonian cycle is the premise of usage in an interconnection network. A novel interconnection network, the incrementally extensible hypercube (IEH) graph, has been proposed. The IEH graphs are derived from hypercubes and also retain most of the properties of hypercubes. Unlike hypercubes without incremental extensibility, IEH graphs can be constructed in any number of nodes. In this paper, we present an algorithm to find a Hamiltonian cycle or path and prove that there exists a Hamiltonian cycle in all IEH graphs except for those containing exactly 2n-1 nodes.[[notice]]補正完畢[[conferencetype]]國際[[conferencedate]]19970428~19970502[[iscallforpapers]]Y[[conferencelocation]]Seoul, KORE

Embedding a complete binary tree into a faulty supercube

[[abstract]]The supercube is a novel interconnection network that is derived from the hypercube. Unlike the hypercube, the supercube can be constructed for any number of nodes. That is, the supercube is incrementally expandable. In addition, the supercube retains the connectivity and diameter properties of the corresponding hypercube. In this paper, we consider the problem of embedding and reconfiguring binary tree structures in a faulty supercube. Further more, for finding the replaceable node of the faulty node, we allow 2-expansion such that we can show that up to (n-2) faults can be tolerated with congestion 1 and dilation 4 that is (n-1) is the dimension of a supercube[[notice]]補正完畢[[conferencetype]]國際[[conferencedate]]19971210~19971212[[iscallforpapers]]Y[[conferencelocation]]Melbourne, Australi

HelpDez : colored-Petri-net-based hypermedia help system designer

This paper describes HelpDez, a colored-Petri-net-based approach for the design, simulation, and construction of hypermedia help systems. The storage model, system capabilities, and user interface model of a hypermedia help system are examined. Colored Petri nets are chosen to model hypermedia help systems due to their graphical expressiveness and their applicability to concurrent, asynchronous systems. Also, they make it easy to carry out general validations using previously developed analysis techniques. Furthermore, colored Petri nets allow concurrent browsing paths of a hypermedia help system to be described by a common subnet, without losing the ability to distinguish between them. A formal definition of the HelpDez model based on the colored Petri nets is presented . This model represents the structural properties of the help information (text, graphics, and sound), as well as specifications of the execution semantics associated with hypermedia help systems. The graphical representation of the colored Petri nets provides a powerful tool for specification of the information users can see and hear simultaneously when a hypermedia help system is executed

Power Saving Mechanism with Optimal Sleep Control in Wireless Sensor Networks

[[abstract]]The sensor node in Wireless Sensor Network is with the characteristics of low power consumption, but the sensor node can not be rechargeable. Therefore, the consumed of power is limited. How to effectively control the power of the sensor node and extend the life time of the whole network become a very important issue. In this paper, we proposed an optimal sleep control mechanism. When the sensor nodes are set randomly in the entire network and the sleeping probability is determined through the distance between the sensor node and the sink. The proposed mechanism will effectively reduce the frequency of the transmission of the sensor nodes more close to the sink and reach the loading balance of the whole network. However, the sleeping sensor nodes will process their sleeping schedule according to their own residual power and achieve the effectiveness of saving power.[[notice]]補正完畢[[incitationindex]]EI[[booktype]]紙

The Chinese Text Categorization System with Category Priorities

[[abstract]]The process of text categorization involves some understanding of the content of the documents and/or some previous knowledge of the categories. For the content of the documents, we use a filtering measure for feature selection in our Chinese text categorization system. We modify the formula of Term Frequency-Inverse Document Frequency (TF-IDF) to strengthen important keywords’ weights and weaken unimportant keywords’ weights. For the knowledge of the categories, we use category priority to represent the relationship between two different categories. Consequently, the experimental results show that our method can effectively not only decrease noise text but also increase the accuracy rate and recall rate of text categorization.[[incitationindex]]EI[[booktype]]紙

Formal Specification in Software Reuse Designs: an Object-Oriented Database Example

[[abstract]]The advantages of using a formal specification are in its precise definition of object properties and its declarative description of operations of a system. The Z notation is used widely in the literature of formal system designs and the research of language semantics. In line with the rapid growth of multimedia omputation research, we use the Z notation to describe a multimedia database that supports the reuse of multimedia presentations. The database consists of two layers: the frame layer and the resource layer. A frame group in the first layer is the basic presentation unit to be reused. A resource group in the second layer is a collection of resources to be used by a frame, or a frame group. In the hierarchy, we use four types of links to group frames and/or resources. The main contribution of this paper is in its reuse mechanism of multimedia objects in a multimedia database